Colour Patterns for Polychromatic Four-colourings of Rectangular Subdivisions
نویسندگان
چکیده
A non-degenerate rectangular subdivision is a subdivision of a rectangle into a set of non-overlapping rectangles S, such that no four rectangles meet in a point. We consider a problem that Katz and colleagues call strong polychromatic four-colouring: Colouring the vertices of the subdivision with four colours, such that each rectangle of S has all colours among its four corners. By considering the possible colouring patterns, we can give short constructive proofs of colourability for subdivisions that are sliceable or one-sided. We also present techniques and observations for nonsliceable, two-sided subdivisions.
منابع مشابه
Acyclic, Star and Oriented Colourings of Graph Subdivisions
Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic subgraph is a forest. A star colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χa(G) and χs(G) denote the acyclic and star chromatic numbers of G. This paper investigates acyclic and star colourings of subdivisions. Let G′ be the graph obtained from G...
متن کاملRandom Sampling of 3-colourings in Z *
We consider the problem of uniformly sampling proper 3-colourings of an m × n rectangular region of Z. We show that the single-site “Glauber-dynamics” Markov chain is rapidly mixing. Our result complements an earlier result of Luby, Randall and Sinclair, which demonstrates rapid mixing when there is a fixed boundary (whose colour cannot be changed). c © John Wiley & Sons, Inc.
متن کاملOn some colouring of 4-cycle systems with specified block colour patterns
The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin., 8 (2001)) of 4-cycle systems with specified block colour patterns that are also strict colourings in the sense of Voloshin (Coloring Mixed Hypergraphs: Theory, Algorithms and Applications, American Mathematical Societ...
متن کاملStar Colourings of Subdivisions
Let G be a graph with chromatic number (G) and maximum degree (G). A star colouring of G is a function that assigns a colour to each vertex such that adjacent vertices receive distinct colours, and there is no bichromatic 4-vertex path. The star chromatic number st(G) is the minimum number of colours in a star colouring of G. Star colourings of subdivisions of graphs are investigated. Let G0 be...
متن کاملExtending partial 3-colourings in a planar graph
Let D be a disc, and let X be a finite subset of vertices on the boundary of D. An essential part of the proof of the four colour theorem is the fact that many sets of 4-colourings of X do not arise from the proper 4-colourings of any graph drawn in D. In contrast to this, we show that every set of 3-colourings of X arises from the proper 3-colourings of some graph drawn in D.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008